Some More Results on Increments of the Wiener Process
نویسندگان
چکیده
منابع مشابه
Some Results on Increments of the Wiener Process
Let λ(T,aT ,α) = { 2aT [ log T aT + α log log T + (1− α) log log aT ]}− 2 where 0 ≤ α ≤ 1 and {W (t), t ≥ 0} be a standard Wiener process. This paper studies the almost sure limiting behaviour of sup 0≤t≤T−aT λ(T,aT ,α)|W (t+aT )−W (t)| as T −→∞ under varying conditions on aT and T aT .
متن کاملthe impact of portfolio assessment on iranian efl students essay writing: a process-oriented approach
this study was conducted to investigate the impact of portfolio assessment as a process-oriented assessment mechanism on iranian efl students’ english writing and its subskills of focus, elaboration, organization, conventions, and vocabulary. out of ninety juniors majoring in english literature and translation at the university of isfahan, sixty one of them who were at the same level of writing...
15 صفحه اولthe effect of keeping reflective journals by language instructors on the process of reading comprehension among iranian high school students
خواندن ودرک مطلب از مهمترین مهارتها در یادگیری زبان خارجی محسوب می شود. این تحقیق تاثیر برگه های تامل برانگیز هدایت شده را در ارتقاع مهارت خواندن ودر ک مطلب در دانش اموزان دبیرستانی ایرانی بررسی می نماید. ازمجموع ?2 دانش آموز سال چهارم دبیرستان شهید رجایی شهرستان اسلامشهر¸ پس از اجرای آزمون استاندارد ((nelson 150a تعداد 39 دانش آموز که نمرات آنها یک سطح انحراف معیار بالاتر یا پایین تر ازمعدل قر...
Some results on vertex-edge Wiener polynomials and indices of graphs
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
متن کاملMORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1983
ISSN: 0091-1798
DOI: 10.1214/aop/1176993449